TSTP Solution File: PUZ104^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ104^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:49:13 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PUZ104^5 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 18:02:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.n38R72GjXZ/Vampire---4.8_11369
% 0.15/0.38 % (11557)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.38 % (11555)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.15/0.38 % (11554)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.15/0.38 % (11558)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.15/0.38 % (11558)Instruction limit reached!
% 0.15/0.38 % (11558)------------------------------
% 0.15/0.38 % (11558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (11558)Termination reason: Unknown
% 0.15/0.38 % (11558)Termination phase: Property scanning
% 0.15/0.38
% 0.15/0.38 % (11558)Memory used [KB]: 895
% 0.15/0.38 % (11558)Time elapsed: 0.003 s
% 0.15/0.38 % (11558)Instructions burned: 2 (million)
% 0.15/0.38 % (11558)------------------------------
% 0.15/0.38 % (11558)------------------------------
% 0.15/0.38 % (11556)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.15/0.38 % (11559)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.15/0.38 % (11555)Instruction limit reached!
% 0.15/0.38 % (11555)------------------------------
% 0.15/0.38 % (11555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (11555)Termination reason: Unknown
% 0.15/0.38 % (11555)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (11555)Memory used [KB]: 5500
% 0.15/0.38 % (11555)Time elapsed: 0.006 s
% 0.15/0.38 % (11555)Instructions burned: 4 (million)
% 0.15/0.38 % (11555)------------------------------
% 0.15/0.38 % (11555)------------------------------
% 0.15/0.38 % (11559)Refutation not found, incomplete strategy
% 0.15/0.38 % (11559)------------------------------
% 0.15/0.38 % (11559)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (11559)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % (11559)Memory used [KB]: 5500
% 0.15/0.38 % (11559)Time elapsed: 0.003 s
% 0.15/0.38 % (11559)Instructions burned: 1 (million)
% 0.15/0.38 % (11559)------------------------------
% 0.15/0.38 % (11559)------------------------------
% 0.15/0.38 % (11561)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.15/0.38 % (11556)First to succeed.
% 0.15/0.39 % (11561)Refutation not found, incomplete strategy
% 0.15/0.39 % (11561)------------------------------
% 0.15/0.39 % (11561)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11561)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (11561)Memory used [KB]: 5500
% 0.15/0.39 % (11561)Time elapsed: 0.005 s
% 0.15/0.39 % (11561)Instructions burned: 2 (million)
% 0.15/0.39 % (11557)Instruction limit reached!
% 0.15/0.39 % (11557)------------------------------
% 0.15/0.39 % (11557)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11557)Termination reason: Unknown
% 0.15/0.39 % (11557)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (11557)Memory used [KB]: 895
% 0.15/0.39 % (11557)Time elapsed: 0.004 s
% 0.15/0.39 % (11557)Instructions burned: 2 (million)
% 0.15/0.39 % (11557)------------------------------
% 0.15/0.39 % (11557)------------------------------
% 0.15/0.39 % (11561)------------------------------
% 0.15/0.39 % (11561)------------------------------
% 0.15/0.39 % (11556)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% 0.15/0.39 thf(func_def_1, type, s: $i > $i).
% 0.15/0.39 thf(func_def_2, type, cCKB6_NUM: $i > $o).
% 0.15/0.39 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.15/0.39 thf(func_def_15, type, sK2: $i > $o).
% 0.15/0.39 thf(func_def_16, type, sK3: ($i > $o) > $i).
% 0.15/0.39 thf(func_def_17, type, ph4: !>[X0: $tType]:(X0)).
% 0.15/0.39 thf(f63,plain,(
% 0.15/0.39 $false),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f62])).
% 0.15/0.39 thf(f62,plain,(
% 0.15/0.39 ($false = $true)),
% 0.15/0.39 inference(forward_demodulation,[],[f61,f42])).
% 0.15/0.39 thf(f42,plain,(
% 0.15/0.39 ($false = (sK2 @ sK0))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f40])).
% 0.15/0.39 thf(f40,plain,(
% 0.15/0.39 ($false = (sK2 @ sK0)) | ($false = $true)),
% 0.15/0.39 inference(superposition,[],[f38,f26])).
% 0.15/0.39 thf(f26,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = (sK2 @ (s @ X1))) | ($false = (sK2 @ X1))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f25])).
% 0.15/0.39 thf(f25,plain,(
% 0.15/0.39 ( ! [X1 : $i] : (($true = ((sK2 @ X1) => (sK2 @ (s @ X1))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f24])).
% 0.15/0.39 thf(f24,plain,(
% 0.15/0.39 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ Y0)))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f23])).
% 0.15/0.39 thf(f23,plain,(
% 0.15/0.39 ((!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ Y0))))) = $true)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f21])).
% 0.15/0.39 thf(f21,plain,(
% 0.15/0.39 (((!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ Y0))))) & (sK2 @ c1)) = $true)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f19])).
% 0.15/0.39 thf(f19,plain,(
% 0.15/0.39 ($false = (((!! @ $i @ (^[Y0 : $i]: ((sK2 @ Y0) => (sK2 @ (s @ Y0))))) & (sK2 @ c1)) => (sK2 @ (s @ (s @ sK0)))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f18])).
% 0.15/0.39 thf(f18,plain,(
% 0.15/0.39 ($false = ((^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ Y1))))) & (Y0 @ c1)) => (Y0 @ (s @ (s @ sK0))))) @ sK2))),
% 0.15/0.39 inference(sigma_clausification,[],[f17])).
% 0.15/0.39 thf(f17,plain,(
% 0.15/0.39 ((!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ Y1))))) & (Y0 @ c1)) => (Y0 @ (s @ (s @ sK0)))))) != $true)),
% 0.15/0.39 inference(beta_eta_normalization,[],[f16])).
% 0.15/0.39 thf(f16,plain,(
% 0.15/0.39 ($true != ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (s @ Y2))))) & (Y1 @ c1)) => (Y1 @ Y0))))) @ (s @ (s @ sK0))))),
% 0.15/0.39 inference(definition_unfolding,[],[f12,f14])).
% 0.15/0.39 thf(f14,plain,(
% 0.15/0.39 (cCKB6_NUM = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (s @ Y2))))) & (Y1 @ c1)) => (Y1 @ Y0))))))),
% 0.15/0.39 inference(cnf_transformation,[],[f6])).
% 0.15/0.39 thf(f6,plain,(
% 0.15/0.39 (cCKB6_NUM = (^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (s @ Y2))))) & (Y1 @ c1)) => (Y1 @ Y0))))))),
% 0.15/0.39 inference(fool_elimination,[],[f5])).
% 0.15/0.39 thf(f5,plain,(
% 0.15/0.39 ((^[X0 : $i] : (! [X1 : $i > $o] : (((X1 @ c1) & ! [X2] : ((X1 @ X2) => (X1 @ (s @ X2)))) => (X1 @ X0)))) = cCKB6_NUM)),
% 0.15/0.39 inference(rectify,[],[f1])).
% 0.15/0.39 thf(f1,axiom,(
% 0.15/0.39 ((^[X0 : $i] : (! [X1 : $i > $o] : (((X1 @ c1) & ! [X2] : ((X1 @ X2) => (X1 @ (s @ X2)))) => (X1 @ X0)))) = cCKB6_NUM)),
% 0.15/0.39 file('/export/starexec/sandbox2/tmp/tmp.n38R72GjXZ/Vampire---4.8_11369',cCKB6_NUM_def)).
% 0.15/0.39 thf(f12,plain,(
% 0.15/0.39 ((cCKB6_NUM @ (s @ (s @ sK0))) != $true)),
% 0.15/0.39 inference(cnf_transformation,[],[f11])).
% 0.15/0.39 thf(f11,plain,(
% 0.15/0.39 ($true = (cCKB6_NUM @ sK0)) & ((cCKB6_NUM @ (s @ (s @ sK0))) != $true)),
% 0.15/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10])).
% 0.15/0.39 thf(f10,plain,(
% 0.15/0.39 ? [X0] : (((cCKB6_NUM @ X0) = $true) & ((cCKB6_NUM @ (s @ (s @ X0))) != $true)) => (($true = (cCKB6_NUM @ sK0)) & ((cCKB6_NUM @ (s @ (s @ sK0))) != $true))),
% 0.15/0.39 introduced(choice_axiom,[])).
% 0.15/0.39 thf(f9,plain,(
% 0.15/0.39 ? [X0] : (((cCKB6_NUM @ X0) = $true) & ((cCKB6_NUM @ (s @ (s @ X0))) != $true))),
% 0.15/0.39 inference(ennf_transformation,[],[f8])).
% 0.15/0.39 thf(f8,plain,(
% 0.15/0.39 ~! [X0] : (((cCKB6_NUM @ X0) = $true) => ((cCKB6_NUM @ (s @ (s @ X0))) = $true))),
% 0.15/0.39 inference(fool_elimination,[],[f7])).
% 0.15/0.39 thf(f7,plain,(
% 0.15/0.39 ~! [X0] : ((cCKB6_NUM @ X0) => (cCKB6_NUM @ (s @ (s @ X0))))),
% 0.15/0.39 inference(rectify,[],[f3])).
% 0.15/0.39 thf(f3,negated_conjecture,(
% 0.15/0.39 ~! [X0] : ((cCKB6_NUM @ X0) => (cCKB6_NUM @ (s @ (s @ X0))))),
% 0.15/0.39 inference(negated_conjecture,[],[f2])).
% 0.15/0.39 thf(f2,conjecture,(
% 0.15/0.39 ! [X0] : ((cCKB6_NUM @ X0) => (cCKB6_NUM @ (s @ (s @ X0))))),
% 0.15/0.39 file('/export/starexec/sandbox2/tmp/tmp.n38R72GjXZ/Vampire---4.8_11369',cCKB6_L4000)).
% 0.15/0.39 thf(f38,plain,(
% 0.15/0.39 ($false = (sK2 @ (s @ sK0)))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f37])).
% 0.15/0.39 thf(f37,plain,(
% 0.15/0.39 ($false = (sK2 @ (s @ sK0))) | ($false = $true)),
% 0.15/0.39 inference(superposition,[],[f20,f26])).
% 0.15/0.39 thf(f20,plain,(
% 0.15/0.39 ($false = (sK2 @ (s @ (s @ sK0))))),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f19])).
% 0.15/0.39 thf(f61,plain,(
% 0.15/0.39 ($true = (sK2 @ sK0))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f60])).
% 0.15/0.39 thf(f60,plain,(
% 0.15/0.39 ($false = $true) | ($true = (sK2 @ sK0))),
% 0.15/0.39 inference(forward_demodulation,[],[f59,f22])).
% 0.15/0.39 thf(f22,plain,(
% 0.15/0.39 ((sK2 @ c1) = $true)),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f21])).
% 0.15/0.39 thf(f59,plain,(
% 0.15/0.39 ($false = (sK2 @ c1)) | ($true = (sK2 @ sK0))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f57])).
% 0.15/0.39 thf(f57,plain,(
% 0.15/0.39 ($true = (sK2 @ sK0)) | ($false = $true) | ($false = (sK2 @ c1))),
% 0.15/0.39 inference(superposition,[],[f35,f51])).
% 0.15/0.39 thf(f51,plain,(
% 0.15/0.39 ($false = (sK2 @ (sK3 @ sK2)))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f50])).
% 0.15/0.39 thf(f50,plain,(
% 0.15/0.39 ($false = $true) | ($false = (sK2 @ (sK3 @ sK2)))),
% 0.15/0.39 inference(forward_demodulation,[],[f49,f22])).
% 0.15/0.39 thf(f49,plain,(
% 0.15/0.39 ($false = (sK2 @ (sK3 @ sK2))) | ($false = (sK2 @ c1))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f48])).
% 0.15/0.39 thf(f48,plain,(
% 0.15/0.39 ($false = (sK2 @ (sK3 @ sK2))) | ($false = (sK2 @ c1)) | ($false = $true)),
% 0.15/0.39 inference(forward_demodulation,[],[f47,f42])).
% 0.15/0.39 thf(f47,plain,(
% 0.15/0.39 ($true = (sK2 @ sK0)) | ($false = (sK2 @ c1)) | ($false = (sK2 @ (sK3 @ sK2)))),
% 0.15/0.39 inference(trivial_inequality_removal,[],[f45])).
% 0.15/0.39 thf(f45,plain,(
% 0.15/0.39 ($false = $true) | ($false = (sK2 @ (sK3 @ sK2))) | ($true = (sK2 @ sK0)) | ($false = (sK2 @ c1))),
% 0.15/0.39 inference(superposition,[],[f26,f34])).
% 0.15/0.39 thf(f34,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (($false = (X1 @ (s @ (sK3 @ X1)))) | ($true = (X1 @ sK0)) | ((X1 @ c1) = $false)) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f33])).
% 0.15/0.39 thf(f33,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (((X1 @ c1) = $false) | ($true = (X1 @ sK0)) | ($false = ((X1 @ (sK3 @ X1)) => (X1 @ (s @ (sK3 @ X1)))))) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f32])).
% 0.15/0.39 thf(f32,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (($true = (X1 @ sK0)) | ((X1 @ c1) = $false) | ($false = ((^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (s @ Y0)))) @ (sK3 @ X1)))) )),
% 0.15/0.39 inference(sigma_clausification,[],[f31])).
% 0.15/0.39 thf(f31,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (($false = (!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (s @ Y0)))))) | ((X1 @ c1) = $false) | ($true = (X1 @ sK0))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f30])).
% 0.15/0.39 thf(f30,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (($true = (X1 @ sK0)) | ($false = ((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (s @ Y0))))) & (X1 @ c1)))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f29])).
% 0.15/0.39 thf(f29,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (((((!! @ $i @ (^[Y0 : $i]: ((X1 @ Y0) => (X1 @ (s @ Y0))))) & (X1 @ c1)) => (X1 @ sK0)) = $true)) )),
% 0.15/0.39 inference(beta_eta_normalization,[],[f28])).
% 0.15/0.39 thf(f28,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : ((((^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ Y1))))) & (Y0 @ c1)) => (Y0 @ sK0))) @ X1) = $true)) )),
% 0.15/0.39 inference(pi_clausification,[],[f27])).
% 0.15/0.39 thf(f27,plain,(
% 0.15/0.39 ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (((!! @ $i @ (^[Y1 : $i]: ((Y0 @ Y1) => (Y0 @ (s @ Y1))))) & (Y0 @ c1)) => (Y0 @ sK0)))))),
% 0.15/0.39 inference(beta_eta_normalization,[],[f15])).
% 0.15/0.39 thf(f15,plain,(
% 0.15/0.39 ($true = ((^[Y0 : $i]: (!! @ ($i > $o) @ (^[Y1 : $i > $o]: (((!! @ $i @ (^[Y2 : $i]: ((Y1 @ Y2) => (Y1 @ (s @ Y2))))) & (Y1 @ c1)) => (Y1 @ Y0))))) @ sK0))),
% 0.15/0.39 inference(definition_unfolding,[],[f13,f14])).
% 0.15/0.39 thf(f13,plain,(
% 0.15/0.39 ($true = (cCKB6_NUM @ sK0))),
% 0.15/0.39 inference(cnf_transformation,[],[f11])).
% 0.15/0.39 thf(f35,plain,(
% 0.15/0.39 ( ! [X1 : $i > $o] : (((X1 @ (sK3 @ X1)) = $true) | ((X1 @ c1) = $false) | ($true = (X1 @ sK0))) )),
% 0.15/0.39 inference(binary_proxy_clausification,[],[f33])).
% 0.15/0.39 % SZS output end Proof for Vampire---4
% 0.15/0.39 % (11556)------------------------------
% 0.15/0.39 % (11556)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11556)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (11556)Memory used [KB]: 5500
% 0.15/0.39 % (11556)Time elapsed: 0.009 s
% 0.15/0.39 % (11556)Instructions burned: 5 (million)
% 0.15/0.39 % (11556)------------------------------
% 0.15/0.39 % (11556)------------------------------
% 0.15/0.39 % (11553)Success in time 0.03 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------